package arithmetic2.day06;

public class Test {
    public static void main(String[] args) {
        Node node1 = new Node(1);
        Node node2 = new Node(2);
        Node node3 = new Node(3);
        Node node4 = new Node(4);
        Node node5 = new Node(5);
        Node node6 = new Node(6);
        Node node7 = new Node(7);
        Node node8 = new Node(8);
        node1.leftChild = node2;
        node1.rightChild = node3;
        node2.leftChild = node4;
        node2.rightChild = node5;
        node3.leftChild = node6;
        node3.rightChild = node7;
        node7.leftChild = node8;
        BinaryTree binaryTree = new BinaryTree(node1);
//        binaryTree.preOrder();
//        System.out.println("===========");
//        binaryTree.preOrder1();
//        binaryTree.inOrder();
//        binaryTree.postOrder1();
//        binaryTree.inOrder1();
//        binaryTree.inOrder2();
//        System.out.println(binaryTree.height());
//        binaryTree.breadthFist();
//        System.out.println(binaryTree.maxWidth());
    }
}
